Channel Selection for Rendezvous with High Link Stability in Cognitive Radio Network

نویسندگان

  • Zhenhua Han
  • Haisheng Tan
  • Yongcai Wang
  • Jipeng Zhou
چکیده

Channel selection is a fundamental problem in Cognitive Radio Networks (CRNs). One basic channel assignment problem is rendezvous, which investigates how secondary users can establish a connection by selecting a common available working channel in the same time slot. Rendezvous is the prerequisite for communication, which however is challenging especially in a dynamic spectrum environment. Link stability is a key factor that benefits the performance of a wireless network. In this work, we study the dynamic channel selection for rendezvous with high link stability. In the centralized case, we propose an algorithm to make as many secondary users as possible to establish stable links. In the distributed case, we derive a novel fast rendezvous strategy in the two-user scenario based on the local idle time of channels. The strategy can be utilized in asynchronous systems. Extensive simulations show that our algorithms have a higher stability in various environments compared with other rendezvous strategies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks

Rendezvous in cognitive radio networks is the process that cognitive users meet and establish a communication link on a commonly available channel, so that consequent information exchange and data communications can be accomplished on the channel. In this study, we propose two ring-walk (RW) rendezvous algorithms to solve the problem of blind rendezvous, i.e., rendezvous without the help of any...

متن کامل

The Life Cycle of the Rendezvous Problem of Cognitive Radio Ad Hoc Networks: A Survey

In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel,...

متن کامل

Efficient Channel-Hopping Rendezvous Algorithm Based on Available Channel Set

In cognitive radio networks, rendezvous is a fundamental operation by which two cognitive users establish a communication link on a commonly-available channel for communications. Some existing rendezvous algorithms can guarantee that rendezvous can be completed within finite time and they generate channel-hopping (CH) sequences based on the whole channel set. However, some channels may not be a...

متن کامل

Efficient Routing For High-Mobility Multi Hop Cognitive Radio Networks

In high-mobility cognitive radio networks (CRNs), the fast topology changes increase the complexity of the routing scheme. In this paper, we propose a novel CRN routing scheme that considers the path stability and node capacity. First, a realistic mobility model is proposed to describe the movement of highly mobile airborne nodes and estimate the link stability performance based on node movemen...

متن کامل

Prediction Based Channel-hopping Algorithm for Rendezvous in Cognitive Radio Networks

Most common works for rendezvous in cognitive radio networks deal only with two user scenarios involving two secondary users and variable primary users and aim at reducing the time-to-rendezvous. A common control channel for the establishment of communication is not considered and hence the work comes under the category of ‘Blind Rendezvous’. Our work deal with multi-user scenario and provides ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014